All-integer column generation for set partitioning: Basic principles and extensions
نویسندگان
چکیده
منابع مشابه
All-integer column generation for set partitioning: Basic principles and extensions
Column generation, combined with an appropriate integer programming technique, has shown to be a powerful tool for solving huge integer programs arising in various applications. In these column generation approaches, the master problem is often of a set partitioning type. The set partitioning polytope has the quasi-integrality property, which enables the use of simplex pivots for finding improv...
متن کاملDynamic Aggregation of Set-Partitioning Constraints in Column Generation
Column generation is often used to solve problems involving set-partitioning constraints, such as vehicle-routing and crew-scheduling problems. When these constraints are in large numbers and the columns have on average more than 8–12 nonzero elements, column generation often becomes inefficient because solving the master problem requires very long solution times at each iteration due to high d...
متن کاملColumn Generation for Linear and Integer Programming
Column generation refers to linear programming (LP) algorithms designed to solve problems in which there are a huge number of variables compared to the number of constraints and the simplex algorithm step of determining whether the current basic solution is optimal or finding a variable to enter the basis is done by solving an optimization problem rather than by enumeration. To the best of my k...
متن کاملMethods and Applications in Integer Programming: All-Integer Column Generation and Nurse Scheduling
Integer programming can be used to provide solutions to complex decision and planning problems occurring in a wide variety of situations. Applying integer programming to a real life problem basically involves a first phase where a mathematical model is constructed, and a second phase where the problem described by the model is solved. While the nature of the challenges involved in the respectiv...
متن کاملBranch-and-Price: Column Generation for Solving Huge Integer Programs
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods i e implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch and bound tree We present classes of models for which this approach decomposes the problem provides tighter LP relaxations and eliminates symmetry We then d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2014
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.08.036